Gain-Scheduling Control With Dynamic Multipliers by Convex Optimization

نویسنده

  • Carsten W. Scherer
چکیده

In this paper we provide a solution to the gain-scheduling synthesis problem (GSP) for structured parametric and dynamic passive uncertainties, which encompasses an approach for norm-bounded uncertainties as considered in classical structured singular value theory. If compared to known approaches, the distinguishing feature is the use of frequency-dependent multipliers to guarantee stability and performance of the controlled system. On the basis of suitable parameterizations of these multipliers, we develop necessary and sufficient conditions for the existence of gain-scheduling controllers and discuss the benefits of this new design methodology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers

Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...

متن کامل

Short-term Generation Scheduling with Transmission and Environmental Constraints Using an Augmented Lagrangian Relaxation

This paper proposes a new approach based on augmented Lagrangian relaxation for short term generation scheduling problem with transmission and environmental constraints. In this method, the system constraints, e.g. load demand, spinning reserve, transmission capacity and environmental constraints, are relaxed by using Lagrangian multipliers, and quadratic penalty terms associated with system lo...

متن کامل

A numerical approach for optimal control model of the convex semi-infinite programming

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

متن کامل

Gain-scheduling control of T-S fuzzy systems with actuator saturation

This paper presents a gain-scheduling output feedback control design method for T-S fuzzy systems with actuator saturation. Different from existing control design methods for T-S fuzzy systems, the basic idea of the proposed approach is to transform the T-S fuzzy model with saturation nonlinearity into the form of linear fractional transformation (LFT). Instead of commonly used fuzzy controller...

متن کامل

Primal-dual exterior point method for convex optimization

We introduce and study the primal-dual exterior point (PDEP) method for convex optimization problems. The PDEP is based on the Nonlinear Rescaling (NR) multipliers method with dynamic scaling parameters update. The NR method at each step alternates finding the unconstrained minimizer of the Lagrangian for the equivalent problem with both Lagrange multipliers and scaling parameters vectors updat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Control and Optimization

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2015